An Improved FCM Algorithm based on Search Space Smoothing
نویسندگان
چکیده
The traditional fuzzy C-means(FCM) algorithm is an optimization algorithm based on gradient descending, it is sensitive to the initial condition and liable to be trapped in a local optimum. Search space smoothing allows a local search heuristics to escape from a poor, local optimum. In this paper, an improved FCM algorithm based on search space smoothing is proposed. By designing a proper smoothing function, we can easily wipe off the most of local optimum point. Experiment result demonstrated that the search space smoothing is very efficient for FCM algorithm, especially in complicated occasions.
منابع مشابه
OPTIMIZATION OF SKELETAL STRUCTURES USING IMPROVED GENETIC ALGORITHM BASED ON PROPOSED SAMPLING SEARCH SPACE IDEA
In this article, by Partitioning of designing space, optimization speed is tried to be increased by GA. To this end, designing space search is done in two steps which are global search and local search. To achieve this goal, according to meshing in FEM, firstly, the list of sections is divided to specific subsets. Then, intermediate member of each subset, as representative of subset, is defined...
متن کاملA Discrete Hybrid Teaching-Learning-Based Optimization algorithm for optimization of space trusses
In this study, to enhance the optimization process, especially in the structural engineering field two well-known algorithms are merged together in order to achieve an improved hybrid algorithm. These two algorithms are Teaching-Learning Based Optimization (TLBO) and Harmony Search (HS) which have been used by most researchers in varied fields of science. The hybridized algorithm is called A Di...
متن کاملAn Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملOptimization of Mixed-Integer Non-Linear Electricity Generation Expansion Planning Problem Based on Newly Improved Gravitational Search Algorithm
Electricity demand is forecasted to double in 2035, and it is vital to address the economicsof electrical energy generation for planning purposes. This study aims to examine the applicability ofGravitational Search Algorithm (GSA) and the newly improved GSA (IGSA) for optimization of themixed-integer non-linear electricity generation expansion planning (GEP) problem. The performanceindex of GEP...
متن کاملAN IMPROVED INTELLIGENT ALGORITHM BASED ON THE GROUP SEARCH ALGORITHM AND THE ARTIFICIAL FISH SWARM ALGORITHM
This article introduces two swarm intelligent algorithms, a group search optimizer (GSO) and an artificial fish swarm algorithm (AFSA). A single intelligent algorithm always has both merits in its specific formulation and deficiencies due to its inherent limitations. Therefore, we propose a mixture of these algorithms to create a new hybrid optimization algorithm known as the group search-artif...
متن کامل